class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) {
        int left = 0;
        int ret = 1;
        while (left <= nums.size() - 1)
        {
            int right = left + 1;
            while (right <= nums.size() - 1 && nums[right] > nums[right - 1])
            {
                right++;
            }
            ret = max(ret, right - left);
            left = right;
        }
        return ret;

    }
};